Model-Checking of Infinite Kripke Structures Defined by Simple Graph Grammars

Model-Checking of CTL on Infinite Kripke Structures Defined by Simple Graph Grammars

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model-checking of infinite Kripke structures defined by simple graph grammars

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model-checking of Ctl on Infinite Kripke Structures Defined by Simple Graph Grammars Yves-marie Quemener and Thierry Jéron

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model-checking of infinite graphs defined by graph grammars

We propose here an algorithm that decides whether a state of an innnite graph deened by a graph grammar satisses a given formula of the alternation-free-calculus. We rst show how graph grammars enable to nitely represent innnite transition systems. In particular, a connection is made between a state of the graph grammar and the states of the innnite graph it represents. We then present succinct...

متن کامل

On Model Checking Durational Kripke Structures

We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap ...

متن کامل

Model-Checking of Infinite Kripke Structures Defined by Simple Graph Grammars

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

منابع مشابه

Model-Checking of CTL on Infinite Kripke Structures Defined by Simple Graph Grammars